Natural Deduction System in Paraconsistent Setting: proof search for PCont

نویسندگان

  • Alexander Bolotov
  • Vasilyi Shangin
چکیده

This paper continues a systematic approach to build natural deduction calculi and corresponding proof procedures for non-classical logics. Our attention is now paid to the framework of paraconsistent logics. These logics are used, in particular, for reasoning about systems where paradoxes do not lead to the ‘deductive explosion’, i.e., where formulae of the type ‘A follows from false’, for any A, are not valid. We formulate the natural deduction system for the logic PCont, explain its main concepts, define a proof searching technique and illustrate it by examples. The presentation is accompanied by demonstrating the correctness of these developments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Classical Extensional Higher-Order Tableau to Intuitionistic Intentional Natural Deduction

We define a translation that maps higher-order formulas provable in a classical extensional setting to semantically equivalent formulas provable in an intuitionistic intensional setting. For the classical extensional higher-order proof system we define a Henkincomplete tableau calculus. For the intuitionistic intensional higher-order proof system we give a natural deduction calculus. We prove t...

متن کامل

Gentzen-type Refutation Systems for Three-Valued Logics

While the purpose of a conventional proof calculus is to axiomatise the set of valid sentences of a given logic, a refutation system, or complementary calculus, is concerned with axiomatising the invalid sentences. Instead of exhaustively searching for counter models for some sentence, refutation systems establish invalidity by deduction and thus in a purely syntactic way. Such systems are rele...

متن کامل

Proof Search and Counter Model of Positive Minimal Predicate Logic

This paper presents an algorithm of proof search for positive formulas in minimal predicate logic. It is based on the LJB deduction system introduced in[2]. The algorithm returns a deduction tree, and hence a proof, when the formula is provable, and a counter-model will be constructed when the formula is unprovable. The soundness and the completeness are proved.

متن کامل

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems

Basic proof search tactics in logic and type theory can be seen as the rootrst applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of de ning such sequent calculi for Pure Type Systems (PTS, which are based on natural deduction) and then organizing their rules for effective proof search....

متن کامل

Proof-Search in Hilbert Calculi

It is well-known [7] that the standard formalizations of classical and intuitionistic logic based on Hilbert calculi, sequent calculi and natural deduction are equivalent. In spite of this, proof-search has been mainly developed around the notion of sequent calculi almost neglecting the cases of natural deduction and Hilbert calculi. This is primarily motivated by the fact that the latters lack...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Intelligent Systems

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2011